منابع مشابه
connected cototal domination number of a graph
a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...
متن کاملFinite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملconnected graphs cospectral with a friendship graph
let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...
متن کاملConnected Treewidth and Connected Graph Searching
Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible. Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible.
متن کاملCounting connected sets and connected partitions of a graph
This paper concerns two related enumeration problems on vertex labeled graphs. Given such a graph G, we investigate the number C(G) of connected subsets of the vertex set and the number P (G) of connected partitions of the vertex set. By connected we mean that the induced subgraphs are connected. The numbers C(G) and P (G) can be regarded as the (connected) graph analogs of the number of subset...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1997
ISSN: 0011-4642,1572-9141
DOI: 10.1023/a:1022404624515